FPGA Implementation of a Maze Routing Accelerator
نویسنده
چکیده
This paper describes the implementation of the L3 maze routing accelerator in an FPGA. L3 supports fast single-layer and multi-layer routing, preferential routing, and rip-up-and-reroute. A 16 X 16 single-layer and 4 X 4 multi-layer router that can handle 2-16 layers have been implemented in a low-end Xilinx XC2S300E FPGA. Larger arrays are currently under construction.
منابع مشابه
FPGA Implementation of a Multilayer Maze Router
This paper describes the design and implementation of an FPGA-based multilayer maze routing accelerator. The accelerator is implemented as an array of small processing elements that corresponds to the horizontal structure of the routing grid. Mulitilayer routing is efficiently implemented by time-multiplexing multiple layers over the twodimensional grid. Prototype accelerators supporiting 8 X 8...
متن کاملL3: An FPGA-based multilayer maze routing accelerator
This paper describes a multi-layer maze routing accelerator which uses a two-dimensional array of processing elements (PEs) implemented in an FPGA. Routing for an L-layer N X N grid is performed by an array of N X N PEs that time-multiplex each layer over the array. This accelerates the classic Lee Algorithm from O(L X d) in software to O(L X d). Each PE can be implemented in 32 look up tables ...
متن کاملFPGA accelerator for floating-point matrix multiplication
This study treats architecture and implementation of a FPGA accelerator for double-precision floating-point matrix multiplication. The architecture is oriented towards minimising resource utilisation and maximising clock frequency. It employs the block matrix multiplication algorithm which returns the result blocks to the host processor as soon as they are computed. This avoids output buffering...
متن کاملMesh Routing Topologies For FPGA Arrays
There is currently great interest in using fixed arrays of FPGAs for logic emulators, custom computing devices, and software accelerators. An important part of designing such a system is determining the proper routing topology to use to interconnect the FPGAs. This topology can have a great effect on the area and delay of the resulting system. Tree, Bipartite Graph, and Mesh interconnection sch...
متن کاملNegotiated A* Routing for FPGAs
In the next few years, logic capacities for fieldprogrammable gate arrays are expected to exceed one million gates per device. While this expansion of FPGA device resources offers the promise of exceptional finegrained performance for developing technologies such as ASIC prototyping and FPGA computing, supporting computer-aided design tools have yet to be developed to target these devices rapid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003